Erik Demaine

Results: 203



#Item
41Algorithms for Designing Pop-Up Cards Zachary Abel∗ Anna Lubiw‡ Erik D. Demaine† Andr´e Schulz§

Algorithms for Designing Pop-Up Cards Zachary Abel∗ Anna Lubiw‡ Erik D. Demaine† Andr´e Schulz§

Add to Reading List

Source URL: giovanniviglietta.com

Language: English - Date: 2013-05-16 16:47:06
    42Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel and Erik D. Demaine, CCCG 2011

    Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel and Erik D. Demaine, CCCG 2011

    Add to Reading List

    Source URL: zacharyabel.com

    - Date: 2016-01-24 17:37:25
      43The Distance Geometry of Deep Rhythms and Scales Erik D. Demaine∗ Perouz Taslakian§ Francisco Gomez-Martin† Godfried T. Toussaint§

      The Distance Geometry of Deep Rhythms and Scales Erik D. Demaine∗ Perouz Taslakian§ Francisco Gomez-Martin† Godfried T. Toussaint§

      Add to Reading List

      Source URL: student.ulb.ac.be

      Language: English - Date: 2009-03-10 11:24:53
        446.890: Algorithmic Lower Bounds: Fun With Hardness Proofs  Fall 2014 Lecture 7 — September 25, 2014 Prof. Erik Demaine

        6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 7 — September 25, 2014 Prof. Erik Demaine

        Add to Reading List

        Source URL: courses.csail.mit.edu

        Language: English - Date: 2014-09-30 00:00:33
          45Class 4 Scribe Notes  Notetakers: Jason Ku, Yun William YuInstructor: Erik Demaine

          Class 4 Scribe Notes Notetakers: Jason Ku, Yun William YuInstructor: Erik Demaine

          Add to Reading List

          Source URL: courses.csail.mit.edu

          Language: English - Date: 2014-09-22 02:27:09
            466.890: Algorithmic Lower Bounds: Fun With Hardness Proofs  Fall 2014 Lecture 12 — October 14, 2014 Prof. Erik Demaine

            6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 12 — October 14, 2014 Prof. Erik Demaine

            Add to Reading List

            Source URL: courses.csail.mit.edu

            Language: English - Date: 2014-10-19 02:26:10
              47CCCG 2006, Kingston, Ontario, August 14–16, 2006  Curves in the Sand: Algorithmic Drawing Mirela Damian∗  Erik D. Demaine†

              CCCG 2006, Kingston, Ontario, August 14–16, 2006 Curves in the Sand: Algorithmic Drawing Mirela Damian∗ Erik D. Demaine†

              Add to Reading List

              Source URL: student.ulb.ac.be

              Language: English - Date: 2009-03-10 11:24:51
                48Deflating The Pentagon Erik D. Demaine∗ Martin L. Demaine∗  Diane L. Souvaine†

                Deflating The Pentagon Erik D. Demaine∗ Martin L. Demaine∗ Diane L. Souvaine†

                Add to Reading List

                Source URL: homepages.ulb.ac.be

                Language: English - Date: 2009-03-10 11:24:55
                  49Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine Computer Science and AI Laboratory Massachusetts Institute of Technology {edemaine,mdemaine}@mit.edu

                  Sand Drawings and Gaussian Graphs Erik D. Demaine Martin L. Demaine Computer Science and AI Laboratory Massachusetts Institute of Technology {edemaine,mdemaine}@mit.edu

                  Add to Reading List

                  Source URL: student.ulb.ac.be

                  Language: English - Date: 2009-03-10 11:25:23
                    50Erratum for “Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs” Nadia M. Benbernou∗ Erik D. Demaine†

                    Erratum for “Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs” Nadia M. Benbernou∗ Erik D. Demaine†

                    Add to Reading List

                    Source URL: www.eecs.tufts.edu

                    Language: English - Date: 2008-07-06 23:09:48